Discrete Optimization with Decision Diagrams
نویسندگان
چکیده
منابع مشابه
Discrete Optimization with Decision Diagrams
We propose a general branch-and-bound algorithm for discrete optimization in which binary decision diagrams (BDDs) play the role of the traditional linear programming relaxation. In particular, relaxed BDD representations of the problem provide bounds and guidance for branching, while restricted BDDs supply a primal heuristic. Each problem is given a dynamic programming model that allows one to...
متن کاملParallel Combinatorial Optimization with Decision Diagrams
We propose a new approach for parallelizing search for combinatorial optimization that is based on a recursive application of approximate Decision Diagrams. This generic scheme can, in principle, be applied to any combinatorial optimization problem for which a decision diagram representation is available. We consider the maximum independent set problem as a specific case study, and show how a r...
متن کاملOptimization Bounds from Binary Decision Diagrams
We explore the idea of obtaining bounds on the value of an optimization problem from a discrete relaxation based on binary decision diagrams (BDDs). We show how to construct a BDD that represents a relaxation of a 0–1 optimization problem, and how to obtain a bound for a separable objective function by solving a shortest (or longest) path problem in the BDD. As a test case we apply the method t...
متن کاملGenetic Algorithm for Ordered Decision Diagrams Optimization
In this paper we present an approach for the optimization of ordered Binary Decision Diagrams (OBDDs), based on Genetic Algorithms. In this method we consider completely specified Boolen Functions (BFs). The method uses specific reordering heuristics [3] and combines them with principles of genetic algorithms in order to determine a good variable ordering. Only small populations are considered ...
متن کاملNumeric Function Generators Using Decision Diagrams for Discrete Functions
This paper introduces design methods for numeric function generators (NFGs) using decision diagrams. NFGs are hardware accelerators to compute values of numeric functions such as trigonometric, logarithmic, square root, and reciprocal functions. Most existing design methods for NFGs are intended only for a specific class of numeric functions. However, by using decision diagrams for discrete fun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2016
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.2015.0648